Forcing Disjoint Segments in the Plane
نویسندگان
چکیده
منابع مشابه
Forcing Disjoint Segments in the Plane
Consider a geometric graph given by n points in the plane (in general position) andm line segments, each segment joining a pair of the given points. We show that: if m ≥ 3n + 1 then there are 3 pairwise disjoint segments; if m ≥ 10n + 1 then there are 4 disjoint segments; and if m ≥ ckn(log n) k−4 then there are k disjoint segments.
متن کاملA Long Noncrossing Path Among Disjoint Segments in the Plane
Let L be a collection of n pairwise disjoint segments in general position in the plane. We show that one can find a subcollection of Ω(n1/3) segments that can be completed to a noncrossing simple path by adding rectilinear edges between endpoints of pairs of segments. On the other hand, there is a set L of n segments for which no subset of size (2n)1/2 or more can be completed to such a path.
متن کاملDisjoint Segments with Maximum Density
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities is maximized. We give the first known polynomial-time algorithm for the problem: For general k, our algorithm runs in O(n k) time. For the special case with k = 2 (respectively, k = 3), we also show how to solve the pro...
متن کاملAlternating paths through disjoint line segments
We show that every segment endpoint visibility graph on disjoint line segments in the plane admits an alternating path of length , answering a question of Bose. This bound is optimal apart from a constant factor. We also give bounds on the constants hidden by the asymptotic notation.
متن کاملStabbers of line segments in the plane
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges for S, finding a stabbing wedge for a set of parallel segments with equal length, and computing other stabbers for S such as a double-wedge and a zigzag. The time and space ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1996
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0032